Termination w.r.t. Q proof of TRS/AG01#3.16.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(0, x) → x
plus(x, s(y)) → s(plus(x, y))
plus(s(x), y) → s(plus(x, y))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(0, x) → x
plus(x, s(y)) → s(plus(x, y))
plus(s(x), y) → s(plus(x, y))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

times₂ > plus₂ > s₁

Status:

trivial